Parameterized Complexity: A Statistical Approach Combining Factorial Experiments with Principal Component Analysis
نویسندگان
چکیده
The new sort developed by Sundararajan and Chakarborty (2007), a modification of Quick sort that removes the interchanges, considers the first element of the array as pivot element. In this paper the pivot element taken is a randomly selected element of the array. The effect of binomial parameters are examined on the average sorting complexity using Principal Component Analysis approach. An attempt is also made to focus on a comparative study of the two algorithms: one called the random pivot element algorithm (RPA) and the other one with first element as the pivot element algorithm called first pivot element algorithm (FPA). The results reveal that the RPA can sort larger number of observations than the FPA.
منابع مشابه
An application of principal component analysis and logistic regression to facilitate production scheduling decision support system: an automotive industry case
Production planning and control (PPC) systems have to deal with rising complexity and dynamics. The complexity of planning tasks is due to some existing multiple variables and dynamic factors derived from uncertainties surrounding the PPC. Although literatures on exact scheduling algorithms, simulation approaches, and heuristic methods are extensive in production planning, they seem to be ineff...
متن کاملFeature Extraction Through LOCOCODE
Low-complexity coding and decoding (LOCOCODE) is a novel approach to sensory coding and unsupervised learning. Unlike previous methods, it explicitly takes into account the information-theoretic complexity of the code generator. It computes lococodes that convey information about the input data and can be computed and decoded by low-complexity mappings. We implement LOCOCODE by training autoass...
متن کاملShift-insertion Sort Revisited: Another Statistical Case Study on Parameterized Complexity Using Factorial Experiments
The present paper makes use of factorial experiments to assess software complexity for negative binomial distribution inputs using a new sorting algorithm which we call shift-insertion sort (insertion sort with shifting). Copyright c © 2011 Yang’s Scientific Research Institute, LLC. All rights reserved.
متن کاملMethodology for Hyperspectral Band Selection
While hyperspectral data are very rich in information, processing the hyperspectral data poses several challenges regarding computational requirements, information redundancy removal, relevant information identification, and modeling accuracy. In this paper we present a new methodology for combining unsupervised and supervised methods under classification accuracy and computational requirement ...
متن کاملFaults and fractures detection in 2D seismic data based on principal component analysis
Various approached have been introduced to extract as much as information form seismic image for any specific reservoir or geological study. Modeling of faults and fractures are among the most attracted objects for interpretation in geological study on seismic images that several strategies have been presented for this specific purpose. In this study, we have presented a modified approach of ap...
متن کامل